Topological Complexity of the Range Searching
نویسنده
چکیده
We prove an existence of a topological decision tree which solves the range searching problem for a system of real polynomials, in other words, the tree finds all feasible signs vectors of these polynomials, with the (topological) complexity logarithmic in the number of signs vectors. This answers the problem posed in [FK98]. 1 Range Searching Problem Let polynomials f1, . . . , fm ∈ R[X1, . . . , Xn]. Our purpose is to solve the range searching problem [FK98] by means of topological decision trees (TDT) [S87]. Namely, TDT allows tests of the form ”P (x) > 0?” for arbitrary polynomials P ∈ R[X1, . . . , Xn] (thus, we ignore the cost of the computations). We say that a TDT solves the range searching problem for the polynomials f1, . . . , fm if any two input points x, y ∈ R n with different signs vectors (sgn(f1), . . . , sgn(fm))(x) 6= (sgn(f1), . . . , sgn(fm))(y) arrive to different leaves of the TDT. As usual, sgn could attain three values. By the topological complexity of a TDT we mean its depth. Denote by N the number of all feasible signs vectors (sgn(f1), . . . , sgn(fm))(x). It is well known (see e.g. [G88]) that N ≤ (md) where deg(fi) ≤ d, 1 ≤ i ≤ n, or in [BPR96] a better bound N ≤ ((2 + ( m n ) )d). The following result answers the problem posed in section 4.2 [FK98].
منابع مشابه
The Impact of the Objective Complexity and Product of Work Task on Interactive Information Searching Behavior
Background and Aim: this study aimed to explore the impact of objective complexity and Product of work task on user's interactive information searching behavior. Method: The research population consisted of MSc students of Ferdowsi university of Mashhad enrolled in 2012-13 academic year. In 3 stages of sampling (random stratified, quota, and voluntary sampling), 30 cases were selected. Each of ...
متن کاملENTROPY OF GEODESIC FLOWS ON SUBSPACES OF HECKE SURFACE WITH ARITHMETIC CODE
There are dierent ways to code the geodesic flows on surfaces with negative curvature. Such code spaces give a useful tool to verify the dynamical properties of geodesic flows. Here we consider special subspaces of geodesic flows on Hecke surface whose arithmetic codings varies on a set with innite alphabet. Then we will compare the topological complexity of them by computing their topological ...
متن کاملInvestigating the relationship among complexity, range, and strength of grammatical knowledge of EFL students
Assessment of grammatical knowledge is a rather neglected area of research in the field with many open questions (Purpura, 2004). The present research incorporates recent proposals about the nature of grammatical development to create a framework consisting of dimensions of complexity, range and strength, and studies which dimension(s) can best predict the stat...
متن کاملInvited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice
Range searching is among the most fundamental and well-studied problems in computational geometry. Given an n-element point set in R, the problem is to preprocess the points so that the total weight, or generally the semigroup sum, of the points lying within a given query range η can be determined quickly. Years of research have resulted in nearly matching upper and lower bounds for many formul...
متن کاملIncreasing the Performance of OFDM Systems by PAPR Reduction in PTS Technique using Election Optimization Algorithm
Orthogonal Frequency Division Multiplexing (OFDM) is a useful technology in wireless communications that provides high-rate data transmission in multipath fading channels. The advantages of OFDM systems are the high spectral efficiency and strong resistance to frequency selective fading. In OFDM systems, a large number of sub-carriers are used to modulate the symbols causing the time-domain OFD...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Complexity
دوره 16 شماره
صفحات -
تاریخ انتشار 2000